Rainbow k-connection in Dense Graphs
نویسندگان
چکیده
An edge-coloured path is rainbow if the colours of its edges are distinct. For a positive integer k, an edge-colouring of a graph G is rainbow k-connected if any two vertices of G are connected by k internally vertex-disjoint rainbow paths. The rainbow k-connection number rck(G) is defined to be the minimum integer t such that there exists an edge-colouring of G with t colours which is rainbow k-connected. We consider rc2(G) when G has fixed vertex-connectivity. We also consider rck(G) for large complete bipartite and multipartite graphs G with equipartitions. Finally, we determine sharp threshold functions for the properties rck(G) = 2 and rck(G) = 3, where G is a random graph. Related open problems are posed. AMS Subject Classificiation Numbers: 05C15, 05C40, 05C80
منابع مشابه
Rainbow Connection of Graphs -- A Survey
The concept of rainbow connection was introduced by Chartrand et al. in 2008. It is fairly interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then try to organize the work into five categories, including (strong) rainbow connection number, rain...
متن کاملComputing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs
A path in an edge-colored graph G is rainbow if no two edges of it are colored the same. The graph G is rainbow-connected if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertices, the graph G is strongly rainbow-connected. The minimum number of colors needed to make G rainbow-connected is known as the rainbow connection number...
متن کاملTotal $k$-Rainbow domination numbers in graphs
Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...
متن کاملRainbow Connection in Brick Product of Odd Cycle Graphs
Abstract. Let G be a nontrivial connected graph on which is defined a coloring N k k G E c ∈ → }, ,...., 3 , 2 , 1 { ) ( : , of the edges of G, where adjacent edges may be colored the same. A path in G is called a rainbow path if no two edges of it are colored the same. G is rainbow connected if G contains a rainbow v u − path for every two vertices u and v in it. The minimum k for which there ...
متن کاملNote on rainbow connection in oriented graphs with diameter 2
In this note, we provide a sharp upper bound on the rainbow connection number of tournaments of diameter 2. For a tournament T of diameter 2, we show 2 ≤ − →rc(T ) ≤ 3. Furthermore, we provide a general upper bound on the rainbow k-connection number of tournaments as a simple example of the probabilistic method. Finally, we show that an edge-colored tournament of kth diameter 2 has rainbow k-co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011